Logics and translations for hierarchical model checking

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Checking for Hybrid Logics

We investigate the complexity of the model checking problem for hybrid logics. We provide model checkers for various hybrid fragments and we prove PSPACEcompleteness for hybrid fragments including binders. We apply our findings to the problems of constraint verification for semistructured data and specification checking for mobile systems.

متن کامل

Model Checking for Combined Logics

F We consider combined model checking procedures for the three ways of combining logics: temporalizations, independent combinations, and the join. We present results on computational complexity and report on experiments with implementations. We also discuss the relevance to time granular logics.

متن کامل

Model Checking Hybrid Logics

We investigate the complexity of the model checking problem for hybrid logics. We provide model checker algorithms for various hybrid fragments and we prove PSPACE-completeness for hybrid fragments including binders. We complement and motivate our complexity results with an application of model checking in hybrid logic to the problems of query and constraint evaluation for semistructured data.

متن کامل

Logics and Algorithms for Software Model Checking

LOGICS AND ALGORITHMS FOR SOFTWARE MODEL CHECKING Swarat Chaudhuri Rajeev Alur Software model checking, an algorithmic, specification-driven approach to software analysis, has emerged as an active area of research in the last few years, producing a number of successful tools. The central question here is: does a model of a procedural program (typically a context-sensitive or pushdown abstractio...

متن کامل

Tableaux and Model Checking for Memory Logics

Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiability and the model checking problems. We first give sound and complete tableaux calculi for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Procedia Computer Science

سال: 2017

ISSN: 1877-0509

DOI: 10.1016/j.procs.2017.08.014